Complexity Ranks of Countable Models
نویسنده
چکیده
We define some variations of the Scott rank for countable models and obtain some inequalities involving the ranks. For mono-unary algebras we prove that the game rank of any subtree does not exceed the game rank of the whole model. However, similar questions about linear orders remain unresolved.
منابع مشابه
Scott Ranks of Models of a Theory
The Scott rank of a countable structure is a measure, coming from the proof of Scott’s isomorphism theorem, of the complexity of that structure. The Scott spectrum of a theory (by which we mean a sentence of Lω1ω) is the set of Scott ranks of countable models of that theory. In ZFC + PD we give a descriptive-set-theoretic classification of the sets of ordinals which are the Scott spectrum of a ...
متن کاملBorel Subgroups of Polish Groups
We study three classes of subgroups of Polish groups: Borel subgroups, Polishable subgroups, and maximal divisible subgroups. The membership of a subgroup in each of these classes allows one to assign to it a rank, that is, a countable ordinal, measuring in a natural way complexity of the subgroup. We prove theorems comparing these three ranks and construct subgroups with prescribed ranks. In p...
متن کاملDescribing free groups
We consider countable free groups of different ranks. For these groups, we investigate computability theoretic complexity of index sets within the class of free groups and within the class of all groups. For a computable free group of infinite rank, we consider the difficulty of finding a basis.
متن کاملCantor-Bendixson ranks of countable SFTs
We show that the possible Cantor-Bendixson ranks of countable SFTs are exactly the finite ordinals and ordinals of the form λ + 3, where λ is a computable ordinal. This result was claimed by the author in his PhD dissertation, but the proof contains an error, which is fixed in this note.
متن کاملOn countable simple unidimensional theories
We prove that any countable simple unidimensional theory T is supersimple, under the additional assumptions that T eliminates hyperimaginaries and that the Dφ-ranks are finite and definable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 48 شماره
صفحات -
تاریخ انتشار 2007